Disjunctive Signed Logic Programs
نویسندگان
چکیده
In this work, we define signed disjunctive programs and investigate the existence of answer sets for this class of programs. Our main argument is based on an analogue to Tarski-fixed point theorem which we prove for multivalued mappings. This is an original approach compared to known techniques used to prove the existence of answer sets for disjunctive programs.
منابع مشابه
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a signing, and show that even for programs with classical negation and disjunc-tion the existence of a signing is a simple syntactic criterion that can guarantee several diierent sorts of good behavior: consistency, coincidenc...
متن کاملOn the Equivalence between Disjunctive and Abductive Logic Programs
This paper presents the equivalence relationship between disjunctive and abductive logic programs. We show that the generalized stable model semantics of abductive logic programs can be translated into the possible model semantics of disjunctive programs, and vice versa. It is also proved that abductive disjunctive programs can be expressed by abductive logic programs under the possible model s...
متن کاملDisjunctive Logic Programs versus Normal Logic Programs
This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures. The equivalence of expressive power of two kinds of logic programs over arbitrary structures ...
متن کاملNORTH- HfRLAND PARTIAL DEDUCTION IN DISJUNCTIVE LOGIC PROGRAMMING
I> This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunct...
متن کاملAn Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure
While it is well-known how normal logic programs may be viewed as a form of abduction and argumentation, the problem of how disjunctive programs may be used for abductive reasoning is rarely discussed. In this paper we propose an abductive semantics for disjunctive logic programs with default negation and show that Eshghi and Kowal-ski's abductive proof procedure for normal programs can be adop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 32 شماره
صفحات -
تاریخ انتشار 1997